An Embedding of Timed Transition Systems in HOL
نویسندگان
چکیده
The theory of Timed Transition Systems (TTSs) developed by Henzinger, Manna and Pnueli provides a formal framework for specifying and reasoning about real-time systems. In this theory a system is described by a set of state transitions with associated time constraints. We report on work in progress to mechanize the published theory of timed transition systems using the HOL theorem prover. Diierent speciication languages may be deened in terms of the TTS model. In particular, a real-time temporal logic (RTTL) has been used for specifying requirements and a graphical notation for specifying system designs. A semantics for each of these languages can be given in terms of TTSs, which can in turn be represented in the HOL logic, and these common semantic interpretations enable formal proofs that one speciication satisses another.
منابع مشابه
Specification and seamless verification of embedded real-time systems: FOCUS on Isabelle
The purpose of this thesis is to create a coupling of the formal specification framework Focus in the generic theorem prover Isabelle/HOL, a logical framework based on Higher-Order Logic. The main focus of this work is on specification and verification of systems that are especially safety critical – embedded real-time systems. Isabelle/HOL is an interactive semi-automatic theorem prover and in...
متن کاملA Case Study Using Timed Transition Diagrams and the HOL Theorem Prover for the Formal Development of a Production Cell
This report illustrates the use of hierarchical timed transition diagrams (HTTDs) and the HOL theorem prover for the formal speciication and veriication of a production cell. The speciication generalizes the geometries and component speeds of the production cell, real-time behaviour is modelled, and veriication is by partially automated deductive proof using the HOL system.
متن کاملSAT Solver verification
This document contains formall correctness proofs of modern SAT solvers. Two different approaches are used — state-transition systems and shallow embedding into HOL. Formalization based on state-transition systems follows [1, 3]. Several different SAT solver descriptions are given and their partial correctness and termination is proved. These include: 1. a solver based on classical DPLL procedu...
متن کاملSAT Solver verification
This document contains formall correctness proofs of modern SAT solvers. Two different approaches are used — state-transition systems and shallow embedding into HOL. Formalization based on state-transition systems follows [1, 3]. Several different SAT solver descriptions are given and their partial correctness and termination is proved. These include: 1. a solver based on classical DPLL procedu...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formal Methods in System Design
دوره 3 شماره
صفحات -
تاریخ انتشار 1992